Set constructors in a logic database language
نویسندگان
چکیده
منابع مشابه
Set-Term Matching in a Logic Database Language
Existing set-term matching algorithms [l] for logic-based database languages, of which set terms have the commutative and idempotent properties, have several problems: Given a pair of set terms, matchers can only be computed uequentiollyand duplicatedmatchers are generated. Hence, these algorithms cannot take the advantage of existing multiple processors for computing all matchers in parallel. ...
متن کاملSet-Term Unification in a Logic Database Language
Deterministic, parallel set-term uniication algorithms for high-order logic-based database languages, of which set terms have the commutative and idempotent properties , are lacking. As a result, an eecient inference mechanism that can be used to determine answers to queries of these database languages deterministically is non-existent. To overcome these shortcomings, we propose a set-term unii...
متن کاملPreference Constructors for Deeply Personalized Database Queries
Deep personalization of database queries requires a semantically rich, easy to handle and flexible preference model. Building on preferences as strict partial orders we provide a variety of intuitive and customizable base preference constructors for numerical and categorical data. For complex constructors we introduce the notion of ‘substitutable values’ (SV-semantics). Preferences with SV-sema...
متن کاملMany-Sorted First-Order Logic Database Language
ion mechanism. Many database researchers have used OSFOL to view the Relational Data Model (RDM) ; however, no RDM has been modelled by MSFOL. This paper first gives a formal definition for MSFOL and then its advantages of expressiveness and of abstraction are illustrated. Two reduction algorithms which can transform an MSFOL-based language into\from an OSFOL-based language are given. The seman...
متن کاملA Hierarchical Database Model for a Logic Programming Language
This paper presents an extended Clausal Database Model for a logic programming language. Instead of being restricted to one global database, as is the case with Prolog, we allow segmentation of the database into database units which are linked together into a semi-lattice. Each database unit defines a database view which includes clauses which have been asserted into that unit as well as clause...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Logic Programming
سال: 1991
ISSN: 0743-1066
DOI: 10.1016/0743-1066(91)90036-o